PathMiner: predicting metabolic pathways by heuristic search
نویسندگان
چکیده
MOTIVATION Automated methods for biochemical pathway inference are becoming increasingly important for understanding biological processes in living and synthetic systems. With the availability of data on complete genomes and increasing information about enzyme-catalyzed biochemistry it is becoming feasible to approach this problem computationally. In this paper we present PathMiner, a system for automatic metabolic pathway inference. PathMiner predicts metabolic routes by reasoning over transformations using chemical and biological information. RESULTS We build a biochemical state-space using data from known enzyme-catalyzed transformations in Ligand, including, 2917 unique transformations between 3890 different compounds. To predict metabolic pathways we explore this state-space by developing an informed search algorithm. For this purpose we develop a chemically motivated heuristic to guide the search. Since the algorithm does not depend on predefined pathways, it can efficiently identify plausible routes using known biochemical transformations.
منابع مشابه
Heurstic search for metabolic engineering: de novo synthesis of vanillin
We present the application of heuristic search to in silico metabolic pathway engineering. In particular, we discuss a new computational approach to elucidate complex pathways and to address the practical challenge of combinatorial complexity in pathway inference. We have implemented this approach in a new computational framework, called PathMiner, which is useful for designing metabolic engine...
متن کاملMetabolic tinker: an online tool for guiding the design of synthetic metabolic pathways
One of the primary aims of synthetic biology is to (re)design metabolic pathways towards the production of desired chemicals. The fast pace of developments in molecular biology increasingly makes it possible to experimentally redesign existing pathways and implement de novo ones in microbes or using in vitro platforms. For such experimental studies, the bottleneck is shifting from implementatio...
متن کاملA heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملNovel Heuristic Search Methods for Protein Folding and Identification of Folding Pathways
Proteins form the very basis of life. If we were to open up any living cell, we wouldfind, apart from DNA and RNA molecules whose primary role is to store geneticinformation, a large number of different proteins that comprise the cell itself (forexample the cell membrane and organelles), as well as a diverse set of enzymes thatcatalyze various metabolic reactions. If enzymes wer...
متن کاملA novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Bioinformatics
دوره 19 13 شماره
صفحات -
تاریخ انتشار 2003